How is Voting Theory Really Useful in Multiagent Systems?
نویسنده
چکیده
For more than a decade it has been taken for granted that social choice theory can inform the design of multiagent systems (narrowly construed). I challenge this common point of view by surveying papers that support it and identifying common pitfalls. I also propose a way forward and present some key challenges. Ultimately, my goal is to spark a rethinking of the theory and practice of multiagent voting, which can potentially benefit both AI and social choice theory.
منابع مشابه
Complexity of some aspects of control and manipulation in weighted voting games
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere behaviour. Manipulative behaviour has received increased attention since the famous Gibbard-Satterthwaite theorem. We examine the computational complexity of manipulation in weighted voting games which are ubiquitous mathematical models used in economics, political science, neuro...
متن کاملManipulation Can Be Hard in Tractable Voting Systems Even for Constant-Sized Coalitions
Voting theory has become increasingly integrated with computational social choice and multiagent systems. Computational complexity has been extensively used as a shield against manipulation of voting systems, however for several voting schemes this complexity may cause calculating the winner to be computationally difficult. Of the many voting systems that have been studied with regard to electi...
متن کاملFalse name manipulations in weighted voting games: splitting, merging and annexation
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational complexity of false-name manipulation in weighted voting games which are an important class of coalitional voting games. Weighted voting games have received increased interest in the multiagent community due to their compac...
متن کاملComputational Complexity of Fundamental Problems in Social Choice Theory
Computational social choice (comsoc) theory is currently an important area of research in computer science and more specifically in AI. The field started with the pioneering work of Bartholdi et al. in 1989 where they explored the the possibility of using computational intractability as a barrier against manipulation. Following that, a vast amount of research explored computational complexity o...
متن کاملMultiagent systems, and the search for appropriate foundations
Over 25 years ago, faced with a request to provide a short description of my research, I ventured that my work focused on the use of economic theory, voting theory, and game theory to establish appropriate foundations for Multiagent Systems (though the original wording was slightly different). That has remained an accurate description of my research, and it is a description that I still use. In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012